Hybrid Variable Neighborhood HyperHeuristics for Exam Timetabling Problems
نویسندگان
چکیده
Exam timetabling is one of the most important administrative activities in universities (e.g. [4], [8], and [19]). Such problems have been the subject of significant research effort across Artificial Intelligence research and Operational Research since the 1960s. A general exam timetabling problem consists of assigning a set of exams into a limited number of timeslots while satisfying a set of constraints: Hard constraints that cannot be violated in any circumstances; and Soft constraints which should be satisfied as much as is possible.
منابع مشابه
Hybrid Variable Neighborhood Approaches to Exam Timetabling
A very important factor for the success of a local search is the neighborhood employed during the search. Variable Neighborhood Search (VNS) algorithms [5] employ more than one neighborhood and change the employment of these neighborhoods during the search. It provides a very effective way of escaping from local optima and is both versatile and successful compared to other local search techniqu...
متن کاملHybrid variable neighbourhood approaches to university exam timetabling
In this paper we propose a variable neighbourhood search (VNS) meta-heuristic [25] for the university examination timetabling problem. In addition to a basic VNS method, we introduce a variety of variants which further improve the quality of the results produced by the technique. We also aim to demonstrate that the proposed technique is capable of producing high quality solutions across a wide ...
متن کاملA hyperheuristic approach to examination timetabling problems: benchmarks and a new problem from practice
Many researchers studying examination timetabling problems focus on either benchmark problems or problems from practice encountered in their institutions. Hyperheuristics are proposed as generic optimisation methods which explore the search space of heuristics rather than direct solutions. In the present study, the performance of tournament-based hyperheuristics for the exam timetabling problem...
متن کاملHybridizations within a graph-based hyper-heuristic framework for university timetabling problems
A significant body of recent literature has explored various research directions in hyperheuristics (which can be thought as heuristics to choose heuristics). In this paper, we extend our previous work to construct a unified graph based hyper-heuristic (GHH) framework, under which a number of local search based algorithms as the high level heuristics are studied to search upon sequences of low ...
متن کاملIterated VND Versus Hyper-heuristics: Effective and General Approaches to Course Timetabling
The course timetabling problem is one of the most difficult combinatorial problems, it requires the assignment of a fixed number of subjects into a number of time slots minimizing the number of student conflicts. This article presents a comparison between state-of-the-art hyper-heuristics and a newly proposed iterated variable neighborhood descent algorithm when solving the course timetabling p...
متن کامل